import java.util.*;

public class Main {
        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            if(n<=0){
                System.out.println(-1);
                return;
            }else if(n <= 2){
                System.out.println(-1);
                return;
            }
            //三角实现
            long[][] tri = new long[n][2*n-1];
            for (int i = 0; i < n; i++) {
                for (int j = n - 1 - i; j < 2 * n - 1; j++) {
                    if (i == 0 ) {
                        if ( j == n - 1) {
                            tri[i][j] = 1;
                        }

                    } else {

                        if (i > 0  && j >= n  - 1 - i && j <= n - 1 + i) {
                            if (j == 0) {
                                tri[i][j] =  tri[i - 1][j] + tri[i - 1][j + 1];
                            } else if (j == 2 * n - 2) {
                                tri[i][j] = tri[i - 1][j - 1] + tri[i - 1][j] ;
                            } else {
                                tri[i][j] = tri[i - 1][j - 1] + tri[i - 1][j] + tri[i - 1][j + 1];
                            }
                        }
                       /* if( i == n-1){
                            if (tri[i][j] % 2 == 0 && tri[i][j] != 0) {
                                System.out.println(j + 1);
                                return;
                            }
                        }*/
                    }
                }
            }

            System.out.println("---------");
            for(int i = 0;i < n;i++){
                    System.out.println(tri[i]+"");

                }
            System.out.println("---------------");

            for(int j = 0; j < 2*n-1;j++){
                if(tri[n-1][j] % 2 == 0 &&tri[n-1][j]!=0){
                    System.out.println(j);
                    return;
                }
            }
            System.out.println(-1);

        }
    }
        //第二题
       /* Scanner in = new Scanner(System.in);
        String s = in.nextLine();
        char ret = s.charAt(0);
        int count = 0;
        if (ret >= 'a'&&ret<='z') {
            ret = (char)(ret - 32);
        }
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) >= 'a' && s.charAt(i) <= 'z') {
                if (((char)(s.charAt(i) - 32)) == ret) {
                    count++;
                }
            } else if (s.charAt(i) >= 'A' && s.charAt(i) <= 'Z') {
                if (s.charAt(i) == ret) {
                    count++;
                }
            }else if(s.charAt(i) == ret){
                count++;
            }

        }
        System.out.print(count);

    }*/
        //第一题杨辉三角的变形
        /*Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        if (n <= 0) {
            System.out.println(-1);
            return;
        } else if (n <= 2) {
            System.out.println(-1);
            return;
        }
        //三角实现
        int[][] tri = new int[n][2 * n + 1];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 2 * n + 1; j++) {
                if (i == 0) {
                    if (j == n)
                        tri[i][j] = 1;
                } else {

                    if (i > 0 && j >= 1 && j <= 2 * n - 1 && j >= n - i && j <= n + i) {
                        tri[i][j] = tri[i - 1][j - 1] + tri[i - 1][j] + tri[i - 1][j + 1];
                    } else {
                        tri[i][j] = 0;
                    }
                }
            }
        }
        for (int j = 0; j < 2 * n + 1; j++) {
            if (tri[n - 1][j] % 2 == 0 && tri[n - 1][j] != 0) {
                System.out.println(j);
                return;
            }
        }
        System.out.println(-1);


    }*/
